Splitting Argumentation Frameworks: An Empirical Evaluation
نویسندگان
چکیده
In a recent paper Baumann [1] has shown that splitting results, similar to those known for logic programs under answer set semantics and default logic, can also be obtained for Dung argumentation frameworks (AFs). Under certain conditions a given AF A can be split into subparts A1 and A2 such that extensions of A can be computed by (1) computing an extension E1 of A1, (2) modifying A2 based on E1, and (3) combining E1 and an extension E2 of the modified variant of A2. In this paper we perform a systematic empirical evaluation of the effects of splitting on the computation of extensions. Our study shows that the performance of algorithms may drastically improve when splitting is applied.
منابع مشابه
Splitting Abstract Dialectical Frameworks
Among the abundance of generalizations of abstract argumentation frameworks, the formalism of abstract dialectical frameworks (ADFs) proved to be powerful in modelling various argumentation problems. Implementations of reasoning tasks that come within ADFs struggle with their high computational complexity. Thus methods simplifying the evaluation process are required. One such method is splittin...
متن کاملParameterized Splitting: A Simple Modification-Based Approach
In an important and much cited paper Vladimir Lifschitz and Hudson Turner have shown how, under certain conditions, logic programs under answer set semantics can be split into two disjoint parts, a “bottom” part and a “top” part. The bottom part can be evaluated independently of the top part. Results of the evaluation, i.e., answer sets of the bottom part, are then used to simplify the top part...
متن کاملAbstract Argumentation Scheme Frameworks
Argumentation Scheme Frameworks Katie Atkinson and Trevor Bench-Capon Department of Computer Science University of Liverpool Liverpool L69 3BX UK {K.M.Atkinson,tbc}@liverpool.ac.uk Abstract. This paper presents an approach to modelling and reasoning about arguments that exploits and combines two of the most popular mechanisms used within computational modelling of argumentation: argumentation s...
متن کاملSplitting an Argumentation Framework
Splitting results in non-mononotonic formalisms have a long tradition. On the one hand, these results can be used to improve existing computational procedures, and on the other hand they yield deeper theoretical insights into how a non-monotonic approach works. In the 90‘s Lifschitz and Turner [1, 2] proved splitting results for logic programs and default theory. In this paper we establish simi...
متن کامل